Method and Apparatus for Allocating and Processing Sequences in Communication System

ABSTRACT

A method and apparatus for allocating and processing sequences in a communication system is disclosed. The method includes: dividing sequences in a sequence group into multiple sub-groups, each sub-group corresponding to its own mode of occupying time frequency resources; selecting sequences from a candidate sequence collection corresponding to each sub-group to form the sequences in the sub-group by: the sequences in a sub-group i in a sequence group k being composed of n sequences in the candidate sequence collection, the n sequences making a |r i/ N i   _ c k/ N p     1   | or |(r i/ N i   _ c k/ N p     1   ) modu m k,i | function value the smallest, second smallest, till the n th  smallest respectively; allocating the sequence group to cells, users or channels. It prevents the sequences highly correlated with the sequences of a specific length from appearing in other sequence groups, thus reducing interference, avoiding the trouble of storing the lists of massive sequence groups.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No. 14/842,618, filed on Sep. 1, 2015, which is a continuation of U.S. patent application Ser. No. 14/068,124, filed on Oct. 31, 2013, now U.S. Pat. No. 9,143,295. U.S. patent application Ser. No. 14/068,124 is a continuation of U.S. patent application Ser. No. 13/545,707, filed on Jul. 10, 2012, now U.S. Pat. No. 8,588,168, which is a continuation of U.S. patent application Ser. No. 12/493,869, filed on Jun. 29, 2009, now U.S. Pat. No. 8,249,006, which is a continuation of International Application No. PCT/CN2008/070431, filed on Mar. 6, 2008. The International Application claims priority to Chinese Patent Application No. 200710073057.4, filed on Mar. 7, 2007, Chinese Patent Application No. 200710100449.5, filed on Apr. 9, 2007, Chinese Patent Application No. 200710103147.3, filed on Apr. 27, 2007, Chinese Patent Application No. 200710112774.3, filed on Jun. 17, 2007, Chinese Patent Application No. 200710123676.X, filed on Sep. 30, 2007, all of which are hereby incorporated by reference in their entireties.

FIELD OF THE APPLICATION

The present application relates to the communication field, and in particular, to a technology for allocating and processing sequences in a communication system.

BACKGROUND OF THE APPLICATION

In the communication system, the Constant Amplitude Zero Auto-Correlation (CAZAC) sequence is a very important communication resource. The specific features are as follows:

The modulo of the amplitude is a constant value, for example, normalized to 1; and

Zero periodical-auto-correlation: except the maximum correlation with the sequence itself, the auto correlation with other cyclic shift of this sequence is zero.

The CAZAC sequence has the above features. Therefore, after Fourier transformation, the sequence in the frequency domain is also a CAZAC sequence. The sequence of this feature may be used as a reference signal for channel estimation in the communication.

For example, in a Single Carrier Frequency Division Multiple Access (SC-FDMA) system, within a symbol time, the elements of the CAZAC sequence are transmitted sequentially on multiple sub-carriers. If the receiver knows the sequence of the transmitted signals, the receiver may perform channel estimation by using the received signals. The transmitted signals have equal amplitudes on every sub-carrier on the frequency domain. Therefore, the receiver may estimate out the channel fading on each sub-carrier fairly. In addition, due to the constant amplitude feature of the CAZAC sequence on the time domain, the peak-to-average value of the transmitted waveform is relatively low, which facilitates transmitting.

In another example, the random access preamble signals in the SC-FDMA system may be made of CAZAC sequences. The preamble sequence of the random access signals may be modulated on the frequency domain sub-carrier, and transformed onto the time domain through Fourier transformation before being transmitted. In this way, through high auto correlation and cross correlation of the CAZAC sequence, little interference exists between the random access preamble signals of different cells and different users.

A CAZAC signal is manifested as a CAZAC signal on both the time domain and the frequency domain. Therefore, the CAZAC signals may also be modulated directly into signals on the time domain that occupies certain bandwidth before being transmitted.

The CAZAC sequence comes in many types. A common type is Zadoff-Chu sequence. Other types include: Generalized Chirplike Sequence (GCL) and Milewski sequence. Taking the Zadoff-Chu sequence as an example, the generation mode or expression of a Zadoff-Chu sequence is as follows:

$\begin{matrix} {{a_{r,N}(k)} = \left\{ \begin{matrix} {{\exp \left\lbrack {{- \frac{j\; 2{\pi \cdot r}}{N}}\left( {{q \cdot k} + \frac{k \cdot \left( {k + 1} \right)}{2}} \right)} \right\rbrack}\mspace{31mu}} \\ {{N\mspace{14mu} {is}\mspace{14mu} {an}\mspace{14mu} {odd}{\mspace{11mu} \;}{number}},{k = 0},1,\ldots \mspace{11mu},{N - 1}} \\ {\exp \left\lbrack {{- \frac{j\; 2{\pi \cdot r}}{N}}\left( {{q \cdot k} + \frac{k^{2}}{2}} \right)} \right\rbrack} \\ {\mspace{14mu} {{N\mspace{14mu} {is}\mspace{14mu} {an}\mspace{14mu} {even}{\mspace{11mu} \;}{number}},{k = 0},1,\ldots \mspace{11mu},{N - 1}}\mspace{11mu}} \end{matrix} \right.} & {{Formula}\mspace{14mu} (1)} \end{matrix}$

wherein r is a parameter generated by the sequence and is relatively prime to N, and q is an integer. When the value of r varies, the sequence differs. r is named as a basic sequence index, and q corresponds to different cyclic shifts. That is, the r value determines the basic sequence, and the q value determines different cyclic shifts of the same basic sequence. The sequence generated by different cyclic shifts of a sequence is known as a cyclic shift sequence generated by the same basic sequence. For two different r values such as r=u,r=v, when (u−v) is relatively prime to N, the two sequences are highly cross-correlated. When N is a prime number, r=1, 2, . . . , N−1, and N−1 different CAZAC sequences are generated. Such sequences are highly cross-correlated. In the above example, when N is a prime number, the absolute value of cross correlation normalized between the two sequences is √{square root over (N)}. The conjugate of the Zadoff-Chu sequence is also a CAZAC sequence.

In a general cellular communication system, when a cell selects a sequence for modulation and transmission, another cell needs to select another sequence having the feature of low cross correlation. For example, in the case of using a Zadoff-Chu sequence, if N is a prime number, each cell selects a different r value, thus ensuring low cross correlation and low interference.

The modulated signals transmitted by a cell may also adopt the fragments of the old sequence or repeat cyclically, which also maintains the auto correlation and cross correlation features of the old sequence properly. Particularly, when the number of sub-carriers that bear the sequence in the cell is not a prime number, it is necessary to select the sequence whose length is equal to the prime number around the number of sub-carriers, and the desired sequences are obtained through segmentation or cyclic extension of the sequences before being transmitted. In the following description, the operations of segmentation or cyclic extension of the sequence are omitted.

When the signals of multiple sequences transmitted by different cells occupy the same time frequency resource, the sequences transmitted by cell A and cell B have the same length, as shown in FIG. 1. For example, two different Zadoff-Chu sequences whose length is a prime number N may be selected. When the basic sequence index of one sequence is different from that of the other, the two sequences are little correlated, and the transmitted signals of different cells are little mutual-interfering.

As shown in FIG. 2, when the signals of the modulated sequence occupy different time frequency resources, some users of cell A transmit sequence-modulated signals on the radio resource with bandwidth B1; meanwhile, some users of cell B transmit sequence-modulated signals on the radio resource with bandwidth B2, and the time frequency resources of the two parts overlap. In the system shown in FIG. 2, all cells have the same sub-carrier width. Within bandwidth B1, 36 sub-carriers exist. Within bandwidth B2, 144 sub-carriers exist. Because the sequence is mapped onto a sub-carrier, the length of the sub-carrier corresponds to the length of the sequence. Evidently, the two cells need to select sequences of different lengths respectively. In this case, the cross interference may be strong between the long sequence and the short sequence, and the sequence planning becomes relatively complex. In the example shown in FIG. 2, only sequences of two lengths exist. In practice, depending on the size of different radio resources occupied by a user's transmission, more sequences of different lengths may exist, and the complexity is higher.

The foregoing modulated signals of the sequences that occupy different time frequency resources occur frequently in the SC-FDMA system. Because the sequence serves as a reference signal and provides the channel estimation required by data demodulation, the sequence is transmitted along with the bandwidth resources of the data. The data bandwidth of the user may have different bandwidth values and locations at different times according to specific scheduling rules. Therefore, the sequence of the reference signal of each different cell occupies the time frequency resources in a way that is frequently changing, and the interference between cells is affected by the correlation of sequences of different lengths. To make matters worse, the system generally uses the shift correlation feature of sequences, obtains multiple code division quadrature sequences through different cyclic time shifts, and allocates them to different users. Therefore, once strong interference occurs between the sequences of two lengths, the users who use the sequences of the two lengths may interfere with each other strongly.

Nevertheless, the modes of the sequence occupying the time frequency resources are not limited to the foregoing examples. For example, sequences of different lengths may be modulated on the time domain at the same sampling frequency, which also brings the issue of correlation between the long sequence and the short sequence. Alternatively, the sequence may occupy the frequency domain sub-carriers at different sub-carrier intervals, or occupy the time sampling points at different time sampling intervals. In other words, the sequence is not modulated on all sub-carriers/sampling points, but modulated at regular intervals equivalent to a specific number of sub-carriers/sampling points.

To sum up, when the sequence occupies the time frequency resource in different modes, the interference among cells is relatively complex. Particularly, when sequences of different lengths exist, the sequences of each length need to be planned separately, and the interference among sequences with different length needs to be considered in a system with multiple cells.

SUMMARY OF THE APPLICATION

An embodiment of the present application provides a method for allocating sequences in a communication system. The method includes:

dividing sequences in a sequence group into multiple sub-groups, where each sub-group corresponds to its own mode of occupying time frequency resources;

selecting sequences from a candidate sequence collection corresponding to each sub-group to form sequences in the sub-group in this way: the sequences in a sub-group i (i is a serial number of the sub-group) in a sequence group k (k is a serial number of the sequence group) are composed of n (n is a natural number) sequences in the candidate sequence collection, where the n sequences make the |r_(i/)N_(i) _(_)c_(k/)N_(p) ₁ | or |(r_(i/)N_(i) _(_)c_(k/)N_(p) ₁ ) modu m_(k,i)| function value the smallest, second smallest, till the n^(th) smallest respectively; N_(p) ₁ is the length of a reference sub-group sequence, c_(k) is a basic sequence index of a sequence with a length of N_(p) ₁ determined by the sequence group k; r_(i) is a basic sequence index in the candidate sequence collection, and N_(i) is the length of a sequence in the candidate sequence collection; m_(k,i) is a variable dependent on the group number k and the sub-group number i; and

allocating the sequence groups to the cells, users or channels.

A method for processing sequences provided in an embodiment of the present application includes:

obtaining a group number k of a sequence group allocated by the system;

selecting n (n is a natural number) sequences from a candidate sequence collection to form sequences in a sub-group i (i is a serial number of the sub-group) in a sequence group k, where the n sequences make the |r_(i/)N_(i) _(_)c_(k/)N_(p) ₁ | or |(r_(i/)N_(i) _(_)c_(k/)N_(p) ₁ ) modu m_(k,i)| function value the smallest, second smallest, till the n^(th) smallest respectively, N_(p) ₁ is the length of a reference sub-group sequence, c_(k) is a basic sequence index of a sequence with a length of N_(p) ₁ determined by the sequence group k; r_(i) is a basic sequence index in the candidate sequence collection, and N_(i) is the length of a sequence in the candidate sequence collection; m_(k,i) is a variable dependent on the group number k and the sub-group number i; and

generating a corresponding sequence according to the sequences in the formed sub-group, and transmitting or receiving the sequences on the time frequency resources corresponding to the sub-group i.

An apparatus for processing sequences provided in an embodiment of the present application includes:

a sequence selecting unit, adapted to: obtain a group number k of a sequence group allocated by the system, and select n (n is a natural number) sequences from a candidate sequence collection to form sequences in a sub-group i (i is a serial number of the sub-group) in the sequence group k (k is a serial number of the sequence group), where the n sequences make the |r_(i/)N_(i) _(_)c_(k/)N_(p) ₁ | or |(r_(i/)N_(i) _(_)c_(k/)N_(p) ₁ ) modu m_(k,i)| function value the smallest, second smallest, and the n^(th) smallest respectively, N_(p) ₁ is the length of a reference sub-group sequence, c_(k) is a basic sequence index of a sequence with a length of N_(p) ₁ determined by the sequence group k; r_(i) is a basic sequence index in the candidate sequence collection, and N_(i) is the length of a sequence in the candidate sequence collection; m_(k,i) is a variable dependent on the group number k and the sub-group number i; and

a sequence processing unit, adapted to: generate a corresponding sequence according to the sequences in the formed sub-group i, and process the sequences on the time frequency resources corresponding to the sub-group I, where the processing includes transmitting and receiving.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows the conventional art where the sequences transmitted by different cells occupy the same time frequency resources and have the same length;

FIG. 2 shows the conventional art where the sequences transmitted by different cells occupy partially overlapped time frequency resources and have different lengths;

FIG. 3 shows a calculation process for determining u and v in an embodiment of the present application;

FIG. 4 is a flowchart of a sequence processing method in an embodiment of the present application;

FIG. 5 shows a structure of a sequence processing apparatus in an embodiment of the present application;

FIG. 6 shows a structure of a sequence processing apparatus in an embodiment of the present application; and

FIG. 7 shows a structure of a sequence processing apparatus in another embodiment of the present application.

DETAILED DESCRIPTION OF THE APPLICATION

A detailed description of the present application is provided hereunder with reference to accompanying drawings and preferred embodiments.

In the Chinese application No. 200610173364.5, which was filed with the State Intellectual Property Office of the People's Republic of China by Huawei Technologies Co., Ltd. on Dec. 30, 2006, a method is provided to overcome the sequence interference caused by different modes of occupying time frequency resources by grouping sequences. The method shows: the sequences in a group are multiple sequences corresponding to different modes of occupying time frequency resources; the strongly correlated sequences are included into a group, and the correlation between different groups is relatively low; and then the sequence groups are allocated among the cells. The strongly correlated sequences are in the same group, and the sequences in the same group are used only in this group. The sequence groups used by different cells are little correlated with each other, thus avoiding strong correlation in the case of using sequences of different lengths in different cells.

The strongly correlated sequences are included into a group. Generally, the composition of all sequences of each group may be stored. When a cell user or channel wants to use a sequence corresponding to a mode of occupying time frequency resources in the allocated sequence group, the desired sequence may be found in the stored sequence group. However, the formation of the sequence group needs a pre-stored table. If the size of the sequence group becomes greater, the storage occupies a huge space, and the searching is time-consuming. The extra storage increases the complexity and wastes hardware resources.

Embodiment 1

In this embodiment, the system allocates sequence groups to the cell, user or channel. The sequences in each sequence group are divided into multiple sequence sub-groups. Each sequence sub-group corresponds to a mode of occupying time frequency resources. In the communication system, each mode of occupying time frequency resources corresponds to a sequence sub-group uniquely. The sequences in each sub-group are selected from the candidate sequence collection corresponding to the sub-group in a specific selection mode. According to the allocated sequence group and the mode of occupying time frequency resources used for the specific transmit signals, the user or channel selects the sequences in the sequence sub-group corresponding to the mode of occupying the time frequency resources of the transmit signals in the allocated sequence group for transmitting or receiving.

A certain selection mode can be: for a random sub-group i, determining a function f_(i)(•) corresponding to the sub-group, where the domain of the function is the candidate sequence collection corresponding to the sub-group; determining n sequences from the candidate sequence collection to form sequences, n is a natural number, in the sub-group i, i is a serial number of the sub-group, in the sequence group k, k is the serial number of the sequence group, where the n sequences make the f_(i)(•) function value the smallest, second smallest, and third smallest respectively, d(a,b) is a two variables function, and G_(k) is a variable determined by the group number k. This selection mode is equivalent to: selecting n sequences from the candidate sequence collection to make the d(f_(i)(•), G_(k)) of all other sequences greater than d(f_(i)(•), G_(k))) of these n sequences.

The foregoing sequence selection mode is described below, taking a Zadoff-Chu sequence, namely, a_(r,N)(z), in the CAZAC sequence as an example:

Each sequence group is composed of M sub-groups. The candidate sequence collection of sub-groups 1, 2, . . . , M includes the Zadoff-Chu sequences whose lengths are N₁, N₂, . . . , N_(M). The Zadoff-Chu sequence whose length is N_(i), namely, the a_(r) _(i) _(,N) _(i) (z), z=0, 1, . . . , N_(i)−1 sequence, has N_(i)−1 different basic sequences, depending on r_(i)=1, 2, . . . , N_(i)−1. Specifically, the function corresponding to the sub-group i (namely, the sub-group i corresponding to the Zadoff-Chu sequence whose length is N_(i)) is f_(i):{a_(r) _(i) _(,N) _(i) (z)}_(z=0, 1, 2, . . . , N) _(i) ⁻¹→r_(i)/N_(i). The domain of this function is a candidate sequence collection corresponding to the sub-group i, r_(i) is an index of the Zadoff-Chu sequence in the candidate sequence collection, and N_(i) is the length of the Zadoff-Chu sequence in the candidate sequence collection.

For the sequence group k=1, 2, . . . , the sub-group numbered p₁ is selected as a reference sub-group. The foregoing G_(k) is defined as

G_(k) = f_(p₁)({a_(c_(k), N_(ρ₁))(z)}_(z = 0, 1,  …  , N₁ − 1)) = c_(k)/N_(p₁),

N_(p) ₁ is the length of the reference sub-group sequence, and c_(k) is a basic sequence index of the sequence with a length of N_(p) ₁ determined by the sequence group k. Particularly, if c_(k)=k is selected, then

G_(k) = f_(p₁)({a_(k)_(, N_(ρ₁))}) = k/N_(p₁).

If the foregoing function d(a,b) is defined as |a−b|, the sequence that makes the

d(ƒ_(p1)(·), G _(k)))=d(ƒ_(p1)(·),ƒ_(p1)({α_(k,N) _(p1) }))

value the smallest in the sub-group numbered p₁ in the sequence group k is the

{α_(k,N) _(p1) }

sequence with the index of r_(p) ₁ =k and length of N_(p) ₁ . In this case, d(f_(p) ₁ (•), G_(k))=0.

The sequences in the sub-group i=m in the sequence group k are n sequences that have the length of N_(m) and make the |r_(m)/N_(m)−k/N_(p) ₁ | value the smallest, second smallest, and third smallest respectively, namely, n sequences that make the

d(ƒ_(m)(·),ƒ_(p1)({α_(k,N) _(p1) })

value smaller, where n is a natural number dependent on k and m.

The foregoing embodiment reveals that: the sequences (for example, i=m, j=p₁) in at least two sub-groups i and j in at least one sequence group k are n (n is a natural number dependent on k, i, and j) sequences selected from the candidate sequence collection and make the value of the function d(f_(i)(•), f_(j)(•)) such as the foregoing

d(ƒ_(i)(·),ƒ_(j)(·))

smallest, second smallest, and third smallest respectively.

This embodiment is introduced below, taking a non-CAZAC sequence such as a Gauss sequence which has high auto correlation and cross correlation features as an example. A formula for generating a Gauss sequence is:

b _(α) _(l) _(,α) _(l−1) _(, . . . ,α) ₀ (n)=exp(−2πj(α_(l) n ^(l)+α_(l−1) n ^(l−1)+ . . . +α₀)), n=0,1,2, . . . ,N   Formula (2)

In formula (2), n^(l) is the highest-order item of the Gauss sequence, l is the highest order, and the value range of l is a positive integer. If l=2, α₂=r/N, where N is a positive integer. If N=2N_(l) and α_(l)=r(N_(l) mod 2)/N+2r/N·p, the Gauss sequence is equivalent to a Zadoff-Chu sequence α_(r,N) _(l) (n) whose indexes are r,N_(l). if l>2, different α_(l)=r/(Nl), r=1, 2, . . . , N−1 values correspond to different Gauss sequence groups, and each group has multiple sequences which depend on the lower-order coefficients α_(l−1), α_(l−2), . . . . In this case, the Gauss sequence is not a CAZAC sequence, but has high auto correlation and cross correlation features. In this embodiment, a_(r,N)(n) is used to represent multiple sequences b_(α) _(l) _(, α) _(l−1) _(, . . . , α) ₀ (n) of α_(l)=r/(lN). One of such sequences is defined as a basic sequence.

For a Gauss sequence a_(r,N)(z), the function corresponding to the sub-group i may be defined as f_(l):{α_(r) _(i) _(,N) _(i) (z)}_(z=0, 1, 2, . . . , N) _(i−1) →r_(i)/N_(i). The domain of this function is a candidate sequence collection corresponding to the sub-group i. In the function, r_(i) is an index of the Gauss sequence in the candidate sequence collection, and N_(i) is the length of the Gauss sequence in the candidate sequence collection.

The function d(a,b) corresponding to the Gauss sequence may be d(a,b)=|(a−b) modu 1|, where the modu 1 operation is defined as making the modulo value included in (−½,½].

Particularly, for the Zadoff-Chu sequence which can be construed as a special example of the Gauss sequence, if the basic sequence index is r=−(N−1)/2, . . . , −1, 0, 1, . . . , (N−1)/2, because |a−b|<½, the modu 1 operation is not required.

However, for general Gauss sequences such as r=1, 3, 5, . . . , N_(l)−2, N_(l)+2, . . . , 2N_(l)−1, N=2N_(l), l=2, α₂=r/(2N_(l)), α_(l)=0, and a_(r,N) (z)_(z=−(N) _(l) _(−1)/2, . . . , −1, 0, 1, 2, . . . , (N) _(l) _(−1)/2), d(a,b)=|(a−b) modu 1| is required. In other words, d(f_(i), f_(j)) of the sequences corresponding to α₂=r_(i)/(2N_(i)) and the sequences corresponding to is α₂=r_(j)/(2N_(j)) is

${{d\left( {f_{i},f_{i}} \right)} = {{{{r_{i}/N_{i}} - {{r_{j}/N_{j}}\; {mod}\; u}}} = {\frac{\left( {{r_{i}N_{j}} - {r_{j}N_{i}}} \right){{mod}{uN}}_{i}N_{j}}{N_{i}N_{j}}}}},$

where the modu N_(i)N_(j) operation is defined as making the modulo value included in (−N_(i)N_(j)/2, N_(i)N_(j)/2]. If l=3 and d(f_(i), f_(j)) of the sequences corresponding to α₃=r_(i)/(3N_(i)) and the sequences corresponding to α₃=r_(j)/(3N_(j)) is d(f_(i), f_(j))=|(r_(i)/N_(i)−r_(j)/N_(j))modu 1| and l=4, 5, . . . , the processing is similar.

The Gauss sequence may be defined in another way. If α_(l)=r_(i)/N, and α_(r) _(i) _(,N) _(i) is used to represent the corresponding Gauss sequence, then the foregoing f_(i) of the function is defined as f_(i):α_(r) _(i) _(,N) _(i) (z)→r_(i)/N_(i), and the function d(a,b) is defined as d(a,b)=|(a−b) modu 1/l|, where the modu 1/l operation makes −1(2l)<(a−b) modu 1/l≦1/(2l). Therefore, the definition of the two types of Gauss sequences generates the same sequence group. The definition of such a measurement function is also applicable to the Zadoff-Chu sequence.

In another embodiment, if the mode of occupying time frequency resources is that the sequence is modulated on the radio resource whose sub-carrier interval (or time domain sampling interval) is s, then the function corresponding to the sub-group with the interval s is: f_(N) _(i) :{a_(s) ₂ _(r) _(i) _(,N) _(i) (z)}_(z=0, 1, 2, . . . , N) _(i) ⁻¹→r_(i)/N_(i), where s is the sub-carrier (or time domain sampling) interval of the radio resource. For a Gauss sequence, the function is f_(N) _(i) :{a_(s) ₂ _(r) _(i) _(,N) _(i) (z)}_(z=0, 1, 2, . . . , N) _(i) ⁻¹→r_(i)/N_(l), where l is the highest order of the Gauss sequence.

The foregoing reference sub-group is set according to multiple factors. A sub-group of a specific sequence length may be selected as a reference sub-group. Preferably, the sub-group with the minimum sequence length in the system is selected as a reference sub-group. The quantity of available sequence groups in the system is the same as the quantity of sequences of this length. Therefore, shorter sequences do not appear repeatedly in different sequence groups. For example, supposing the shortest sequence length according to the resource occupation mode is 11 in the system, then in the foregoing method, N_(p) ₂ =N₁=11. In this case, 10 sequence groups are available in the system.

Alternatively, the sub-group with the maximum sequence length in the sequence group may be selected as a reference sub-group. For example, the maximum sequence length in the sequence group is 37, and a sub-group with the sequence length 37 is selected as a reference sub-group. In this case, N_(p) ₁ =N₂=37, and 36 sequence groups are available. When r₂ meets −1/(2N₁)<r₂/N₂<1/(2N₁), if the value of r₁ is not limited to r₁=1, 2, . . . , N₁−1, then r₁ that makes the |r₂/N₂−r₁/N₁| value the smallest is 0. In practice, the value 0 of r₁ does not correspond to the Zadoff-Chu sequence. Therefore, r₂ that makes −1/(2N₁)<r₂/N₂<1/(2N₁), namely, r₂=+1,−1, may be removed. In this way, there are 34 groups of sequences in total. In a sequence group, the quantity of the shortest sequences is less than 36. Therefore, the shortest sequences are used repeatedly.

Moreover, the reference sub-group may be a default sub-group of the system, and may be set by the system as required and notified to the user. After a sequence in the reference sub-group j is selected, the sequences in the sub-group i are n sequences that make the d(f_(i)(•), f_(j)(•)) value smaller, and are in the sequence group that contain the sequences selected for the reference sub-group j. Different sequence groups are generated by selecting different sequences of the reference sub-group j.

The sequence group formed in the above method is described below through examples.

There are 3 sub-groups in total in this embodiment. The sequence candidate collection includes Zadoff-Chu sequences whose lengths are 11, 23 and 37 respectively, corresponding to three resource occupation modes. If N_(p) ₁ =N₁=11 is selected, then there are 10 sequence groups in total. By selecting the sequences that make the absolute value of (r_(m)/N_(m)−r₁/N₁) the smallest and including them into each sequence group, where each sub-group contains only one sequence and the sequence is represented by a basic sequence index, the following table is generated:

N₂ = 23 N₃ = 37 N₁ = 11 Basic Basic Group Sequence Sequence Number K Index r₂ Index r₃ 1 2 3 2 4 7 3 6 10 4 8 13 5 10 17 6 13 20 7 15 24 8 17 27 9 19 30 10 21 34

The foregoing grouping method makes the absolute value of r_(m)/N_(m)−r₁/N₁=(N₁r_(m)−N_(m)r₁)/(N₁N_(m)) the smallest, namely, makes the absolute value of N₁r_(m)−N_(m)r₁ the smallest. That is, the method ensures high correlation between sequences. As verified, the correlation between the sequences in each sequence group in Table 1 is very high.

In the foregoing embodiment, selection of the n sequences comes in two circumstances:

Preferably, n is 1, namely, in the foregoing example, a sequence that makes (r_(m)/N_(m)−k/N₁) the smallest is selected and included into a sub-group m.

Preferably, n is a natural number greater than 1, and the value of n depends on the length difference between sub-group N_(m) and reference sub-group N₁. The sequences corresponding to several basic sequence indexes near r_(m) that makes (r_(m)/N_(m)−k/N₁) the smallest are included into a sub-group. Generally, such sequences are n sequences closest to the minimum r_(m), where n depends on the length difference between N₁ and N_(m).

For example, if N_(m) is about 4×N₁, two r_(m)'s may be included into the group. Generally, n=┌N_(m)/(2N₁)┐ may be selected. In an example, n=└N_(m)/N₁┘ may be selected, where └z┘ is the maximum integer not greater than z. In the sequence sub-group in this case, there may be more than one sequence of a certain length. After such allocation in the system, when using the sequence, the user may select any of the allocated n sequences for transmitting, for example, select the sequence that makes (r_(m)/N_(m)−k/N₁) the smallest, second smallest, and so on.

When two Zadoff-Chu sequences of different lengths are highly correlated, it is sure that |r_(m)/N_(m)−r₁/N₁| is relatively small. In the foregoing allocation method, it is ensured that the value of |r_(i)/N_(i)−r_(j)/N_(j)| between two sub-groups i,j of different groups is great. Therefore, the sequences are little correlated between different groups, and the interference is low. Further, among the sequences of certain lengths, some may be selected for allocation, and the remaining are not used in the system. This prevents the sequences the second most correlated with the sequences in the reference sub-group from appearing in other sequence groups, and reduces strong interference.

If the foregoing function d(a,b) is defined as |(a−b) modu m_(k,i)|, where modu m_(k,i) causes the value of the function d(a,b) after this operation to be included in (−m_(k,i)/2,m_(k,i)/2], and m_(k,i) is a variable determined by the group number k and sub-group number i, then m_(k,i)=1/B, where B is a natural number, namely, m_(k,i)ε{1, ½, ⅓, ¼, . . . }.

The foregoing sequence allocation mode is described below, taking a Zadoff-Chu sequence, namely, a_(r,N)(z), in the CAZAC sequence as an example:

For the sequence group k=1, 2, . . . , the sub-group numbered p₁ is selected as a reference sub-group. The foregoing G_(k) is defined as

G_(k) = f_(p₁)({a_(w_(k), N_(ρ₁))(z)}_(z = 0, 1,  …  , N₁ − 1)) = w_(k)/N_(p₁),

N_(p) ₁ is the length of the reference sub-group sequence, and w_(k) is a basic sequence index of the sequence with a length of N_(p) ₁ determined by the sequence group k. Particularly, if w_(k)=k is selected, then

G_(k) = f_(p₁)({a_(k)_(, N_(ρ₁))}) = k/N_(p₁).

Therefore, the sequence that makes the

d(ƒ_(p1)(·),G _(k))−d(ƒ_(p1)(·), ƒ_(p1)({α_(k,N) _(p1) }))

value the smallest in the sub-group numbered p₁ in the sequence group k is the

{α_(k,N) _(p1) }

sequence with the index of r_(p) ₁ =k and length of N_(p) ₁ . In this case, d(f_(p) ₁ (•),G_(k))=0.

The sequences in the sub-group i=q in the sequence group k are n sequences that have the length of N_(q) and make the |(r_(q)/N_(q)−k/N_(p) ₁ ) modu m_(k,q)| value the smallest, second smallest, and third smallest respectively, namely, n sequences that make the

d(ƒ_(p1)(·),ƒ_(p1) ({α_(k,N) _(p1) }))

value the smallest.

It should be noted that the foregoing function d(a,b)=|(a−b) modu m_(k,i)| may vary between different sequence groups, or different sub-groups of the same sequence group. For example, all sub-groups of one sequence group adopt a d(a,b) function, and all sub-groups of another sequence group adopt another d(a,b) function. Alternatively, one sub-group adopts a d(a,b) function, and another sub-group may adopt another d(a,b) function. Specifically, m_(k,i) in the function has different values, which give rise to different measurement functions.

The sequence group formed in the foregoing method is described below through examples.

There are 3 sub-groups in total in this embodiment. The sequence candidate collection includes Zadoff-Chu sequences whose lengths are 31, 47 and 59 respectively, corresponding to three resource occupation modes. If N_(p) ₁ =N₁=31 is selected, then there are 30 sequence groups in total. By using m_(k,q) in Table 2 and selecting the sequences that make |(r_(q)/N_(q)−k/N₁) modu m_(k,q)| the smallest and including them into each sequence group, where each sub-group contains only one sequence and the sequence is represented by a basic sequence index, Table 3 is generated:

TABLE 2 N₁ = 31 Group N₂ = 47 N₃ = 59 Number K m_(k,2) m_(k,3) 1 ½ 1 2 1 1 3 ½ ⅓ 4 1 ½ 5 ½ ½ 6 1 ½ 7 ½ ⅓ 8 1 1 9 ⅓ 1 10 1 1 11 ⅓ 1 12 1 1 13 ⅓ 1 14 ¼ ½ 15 ⅓ ½ 16 ⅓ ½ 17 ¼ ½ 18 ⅓ 1 19 1 1 20 ⅓ 1 21 1 1 22 ⅓ 1 23 1 1 24 ½ ⅓ 25 1 ½ 26 ½ ½ 27 1 ½ 28 ½ ⅓ 29 1 1 30 1/2 1

TABLE 3 N₂ = 47 N₃ = 59 N₁ = 31 Basic Basic Group Sequence Sequence Number K Index r₂ Index r₃ 1 25 2 2 3 4 3 28 45 4 6 37 5 31 39 6 9 41 7 34 33 8 12 15 9 45 17 10 15 19 11 1 21 12 18 23 13 4 25 14 33 56 15 7 58 16 40 1 17 14 3 18 43 34 19 29 36 20 46 38 21 32 40 22 2 42 23 35 44 24 13 26 25 38 18 26 16 20 27 41 22 28 19 14 29 44 55 30 22 57

The following grouping method makes |(r_(q)/N_(q)−k/N₁) modu m_(k,q)| smallest. As verified, all the sequences in Table 3 are the sequences the most correlated with the sequences in the reference sub-group of the same sequence group. Therefore, the correlation of the sequences between different groups is further reduced, and the inter-group interference is weaker.

When the number of sub-carriers that bear the sequence in the cell is not a prime number, it is necessary to select the sequence whose length is equal to the prime number around the number of sub-carriers, and the desired sequence is obtained through sequence segmentation or cyclic extension of the sequence before being transmitted.

The following description takes cyclic extension as an example. In this embodiment, there are quantities of sub-carriers that bear the sequences: 36, 48, and 60. The sequences with a length of the maximum prime number less than the quantity of sub-carriers, namely, the Zadoff-Chu sequences corresponding to the lengths 31, 47 and 59, are selected, and the desired sequences are obtained through cyclic extension of such sequences. If N_(p) ₁ =N₁=31 is selected, then there are 30 sequence groups in total. By using m_(k,q) in Table 4 and selecting the sequences that make |(r_(q)/N_(q)−k/N₁) modu m_(k,q)| the smallest and including them into each sequence group, where each sub-group contains only one sequence and the sequence is represented by a basic sequence index, Table 5 is generated:

TABLE 4 N₁ = 31 N₁ = 31 N₂ = 47 Group N₂ = 47 N₃ = 59 Group N₃ = 59 m_(k,2) Number K m_(k,2) m_(k,3) Number K m_(k,3) 1 ½ 1 16 ⅓ ½ 2 1 1 17 1 ⅓ 3 ½ ⅓ 18 ⅓ ⅓ 4 1 ½ 19 1 1 5 ½ ½ 20 ⅓ 1 6 1 ½ 21 1 1 7 ⅓ ⅓ 22 ⅓ 1 8 1 1 23 1 1 9 ⅓ 1 24 ⅓ ⅓ 10 1 1 25 1 ½ 11 ⅓ 1 26 ½ ½ 12 1 1 27 1 ½ 13 ⅓ ⅓ 28 ½ ⅓ 14 1 ⅓ 29 1 1 15 ⅓ ½ 30 ½ 1

TABLE 5 N₂ = 47 N₃ = 59 N₁ = 31 Basic Basic Group Sequence Sequence Number K Index r₂ Index r₃ 1 25 2 2 3 4 3 28 45 4 6 37 5 31 39 6 9 41 7 42 33 8 12 15 9 45 17 10 15 19 11 1 21 12 18 23 13 4 5 14 21 7 15 7 58 16 40 1 17 26 52 18 43 54 19 29 36 20 46 38 21 32 40 22 2 42 23 35 44 24 5 26 25 38 18 26 16 20 27 41 22 28 19 14 29 44 55 30 22 57

The following grouping method makes |(r_(q)/N_(q)−k/N₁) modu m_(k,q)| the smallest. As verified, all the sequences in Table 5 are the sequences the most correlated with the sequences in the reference length of the same sequence group. Therefore, the correlation of sequences between different groups is further reduced, and the inter-group interference is weaker.

The specific value of m_(k,q) may be: if N_(q)≧L_(r), then m_(k,q)=1, where N_(q) is the sequence length of the sub-group q, and L_(r) is determined by the reference sub-group sequence length N_(p) ₁ . Specifically, for N_(p) ₁ =N₁=31, L_(r)=139. If N_(q)=139 or above, then m_(k,q)=1. After cyclic extension of the sequence, L_(r)=191. Therefore, when N_(q)=191 or above, m_(k,q)=1.

In the foregoing embodiment, selection of the n sequences comes in two circumstances:

Preferably, n is 1, namely, in the foregoing example, a sequence that makes |(r_(q)/N_(q)−k/N₁) modu m_(k,q)| the smallest is selected and included into the sub-group q.

Preferably, n is a natural number greater than 1, and the value of n depends on the length difference between sub-group N_(q) and reference sub-group N₁. The sequences corresponding to several basic sequence indexes near r_(q) that makes |(r_(q)/N_(q)−k/N₁) modu m_(k,q)| the smallest are included into a sub-group. Generally, such sequences are n sequences closest to the minimum r_(q), where n depends on the length difference between N₁,N_(q). For example, if N_(q) is about 4×N¹, two r_(q)'s may be included into the group. Generally, n=|N_(q)/(2N₁)| may be selected, where ┌z┐ is the minimum integer greater than z. In another example, n=└N_(q)/N₁┘ may be selected, where └z┘ is the maximum integer not greater than z. In the sequence sub-group in this case, there may be more than one sequence of a certain length. After such allocation in the system, when using the sequence, the user may select any of the allocated n sequences for transmitting, for example, select r_(q)=f that makes |(r_(q)/N_(q)−k/N¹) modu m_(k,q)| the smallest, then the fewer n sequences are f±1, f±2, . . . . The transmitter and the receiver may obtain the data through calculation in this way rather than store the data.

When two Zadoff-Chu sequences of different lengths are highly correlated, it is sure that |(r_(q)/N_(q)−r₁/N₁) modu m_(r) ₁ _(,q)| is relatively small. In the foregoing allocation method, it is ensured that the value of i,j between two sub-groups |(r_(i)/N_(i)−r_(j)/N_(j)) modu m_(r) _(j) _(,i)| of different groups is great. Therefore, the sequences are little correlated between different groups, and the interference is low. Further, among the sequences of certain lengths, some may be selected for allocation, and the remaining are not used in the system. This prevents the sequences the second most correlated with the sequences in the reference sub-group from appearing in other sequence groups, and reduces strong interference between groups.

In other embodiments, the definition of the foregoing function d(a,b) may also be

${d\left( {a,b} \right)} = \left\{ {\begin{matrix} {{{a - b}},{{{when}\mspace{14mu} u} \leq \left( {a - b} \right) \leq v}} \\ {{infinity},{others}} \end{matrix},{{{or}{d\left( {a,b} \right)}} = \left\{ {\begin{matrix} {{{\left( {a - b} \right){{mod}{um}}_{k,i}}},{{{when}\mspace{14mu} u} \leq {\left( {a - b} \right){mod}\; {um}_{k,i}} \leq v}} \\ {{infinity},{others}} \end{matrix}.} \right.}} \right.$

The infinity in the definition of the d(a,b) function filters out certain sequences, and ensures low correlation between different groups.

It should be noted that the foregoing function

${d\left( {a,b} \right)} = \left\{ {{\begin{matrix} {{{a - b}},{{{when}\mspace{14mu} u} \leq \left( {a - b} \right) \leq v}} \\ {{infinity},{others}} \end{matrix}\mspace{14mu} {or}{d\left( {a,b} \right)}} = \left\{ \begin{matrix} {{{\left( {a - b} \right){{mod}{um}}_{k,i}}},{{{when}\mspace{14mu} u} \leq {\left( {a - b} \right){mod}\; {um}_{k,i}} \leq v}} \\ {{infinity},{others}} \end{matrix} \right.} \right.$

may vary between different sequence groups, or different sub-groups of the same sequence group. For example, all sub-groups of one sequence group adopt a d(a,b) function, and all sub-groups of another sequence group adopt another d(a,b) function. Alternatively, one sub-group adopts a d(a,b) function, and another sub-group may adopt another d(a,b) function.

Specifically, u,v in the function has different values, which give rise to different measurement functions. For example, u=0, v=+∞, or u=−∞, v=0, or u=−1/(2×11)+1/(23×4), v=1/(2×11)−1/(23×4), or u=a, v=b, where a,b depend on the sequence group k and sub-group i, and so on.

Specifically, in the foregoing embodiment of f₁:{a_(r) _(i) _(,N) _(i) (z)}_(z=0, 1, 2, . . . , N) _(i) ⁻¹→r_(i)/N_(i), if

${d\left( {a,b} \right)} = \left\{ {\begin{matrix} {{{a - b}},{{{when}\mspace{14mu} u} \leq \left( {a - b} \right) \leq v}} \\ {{infinity},{others}} \end{matrix},} \right.$

this embodiment is: selecting the sequences that meet u≦(r_(i)/N_(i)−k/N_(p) ₁ )≦v and including them into each sequence group; |r_(i)/N_(i)−r_(j)/N_(j)|>1/C_(i) is met between any two sequences of different sequence groups, where N_(i)<N_(j), as detailed below:

First, u=0, v=+∞ or u=−∞, v=0, namely, the sequences that make the value the smallest in a single direction. For the positive direction, it is equivalent to selecting the sequences that meet (r_(m)/N_(m)−k/N_(p) ₁ )≧0; for the negative direction, it is equivalent to selecting the sequences that meet (k/N_(p) ₁ −r_(m)/N_(m))≧0. For example, if the sub-group length is N_(m), the positive result closest to k/N_(p) ₁ is r_(m) with the difference of 0.036, and the negative result closest to k/N_(p) ₁ is r_(m)′ with the difference of −0.025. The one the most correlated with the r_(p) ₁ =k sequence of a length of N_(p) ₁ is r_(m)′. If the system specifies that the sequence in the positive direction of (r_(m)/N_(m)−k/N_(p) ₁ ) needs to be selected, r_(m) is selected. The benefit is: after the sequences of various lengths are compared with k/N_(p) ₁ , the difference between the function values, namely, |r_(i)/N_(i)−r_(j)/N_(j)|, is smaller.

Secondly, u=−1/(2N_(p) ₁ )+1/(4N_(p) ₁ ) and v=1/(2N_(p) ₁ )−1/(4N_(p) ₁ ) may be selected. The length (N_(p) ₁ ) of the reference sequence is the shortest sequence length and N_(p) ₂ is the sequence length only greater than N_(p) ₁ . Here is an example:

In this embodiment, there are 4 sub-groups in total. The candidate sequence collections contain Zadoff-Chu sequences with N₁=11, N₂=23, N₃=37, and N₄=47 respectively. By selecting the sequences that meet |r_(i)/N_(i)−k/N₁|<1/(2N₁)−1/(4N₂), namely |r_(i)/N_(i)−k/N₁|<1/(2×11)−1/(4×23) and including them into the sub-groups of each sequence group, the following table is generated, where the sequence is represented by a basic sequence index:

TABLE 6 N₁ = 11 N₂ = 23 N₃ = 37 N₄ = 47 Group Basic Sequence Basic Sequence Basic Sequence Number K Index r₂ Index r₃ Index r₄ 1  2 3, 4 3, 4, 5 2  4 6, 7, 8 7, 8, 9, 10 3 6, 7 9, 10, 11 12, 13, 14 4 8, 9 13, 14 16, 17, 18 5 10, 11 16, 17, 18 20, 21, 22 6 12, 13 19, 20, 21 25, 26, 27 7 14, 15 23, 24 29, 30, 31 8 16, 17 26, 27, 28 33, 34, 35 9 19 29, 30, 31 37, 38, 39, 40 10 21 33, 34 42, 43, 44

In table 6, |r_(i)/N_(i)−r_(j)/N_(j)|>1/(2N_(i)) is met between any two sequences of different sequence groups, where N_(i)<N_(j). In this way, the correlation between the two sequences is relatively lower.

Thirdly, for different sequence groups k and different sub-groups i in the same sequence group, u,v may differ.

The shortest sequence is selected as a reference sequence. Therefore, N_(p) _(l) represents the length of the shortest sequence, and N_(p) _(L) represents the length of the longest sequence; the sequence group that includes the basic sequence with a length of N_(p) _(l) and an index of l is numbered “q_(l)”; the sequence group that includes the basic sequence with a length of N_(p) _(l) and an index of N_(p) _(l) −1 is numbered

“q_(N) _(p1) ⁻¹”

the sequence group that includes the basic sequence with a length of N_(p) _(l) and an index of k is numbered “q_(k)”; the sequence group that includes the basic sequence with a length of N_(p) _(l) and an index of k+l is numbered “q_(k+l)”; the sub-group that includes the basic sequence with a length of N_(p) _(l) is numbered “p_(l)”; the sub-group that includes the basic sequence with a length of N_(p) _(m) is numbered “p_(m)”; the sub-group that includes the basic sequence with a length of N_(p) _(i−1) is numbered “p_(i−1)”; and the sub-group that includes the basic sequence with a length of N_(p) _(i) is numbered “p_(i)”, where N_(p) _(i−1) <N_(p) _(i) .

Step 1001: For the sub-group p_(l) of the sequence group q_(l), u_(q) _(l) _(,p) _(l) =−1/(2N_(p) _(l) )+δu, where 1/N_(p) _(L) −1/N_(p) _(l) +1/(2N_(p) _(l) )≦δ_(u)<½(N_(p) _(l) ).

v_(q) _(k) _(,p) _(l) of the sub-group p_(l) of the sequence group q_(k) and u_(q) _(k+1) _(,p) _(l) of the sub-group p_(l) of the sequence group q_(k+1) (k=1, . . . , N_(p) _(l) −2) are:

v _(q) _(k) _(,p) _(l) =1/D,u _(q) _(k+1) _(,p) _(l) =−1/D, where 1/D≦1/(2N _(p) _(l) ).

Step 1002: As shown in FIG. 3, v_(q) _(k) _(,p) _(l) of the sub-group p_(l) of the sequence group q_(k) and u_(q) _(k+1) _(,p) _(l) of the sub-group p_(l) of the sequence group q_(k+1) (k=1, . . . , N_(p) _(l) −2, lεS) are:

right_(q) _(k) _(,p) _(i−1) =v _(q) _(k) _(,p) _(i−1) +k/N _(p) ₁ , left_(q) _(k+1) _(,p) _(i−1) =u _(q) _(k+1) _(,p) _(i−1) +(k+1)/N _(p) ₁

For the basic sequence with a length of N_(p) _(i−1) , depending on the value of r_(p) _(i−1) , r_(q) _(k+1) _(,p) _(i−1) that meets r_(p) _(i−1) /N_(p) _(i−1) −left_(q) _(k+1) _(,p) _(i−1) ≧0 and minimum |r_(p) _(i−1) /N_(p) _(i−1) −left_(q) _(k+1) _(,p) _(i−1) | is obtained, namely, the obtained basic sequence r_(q) _(k+1) _(,p) _(i−1) is included in the sequence group q_(k+1), has a length of N_(p) _(i−1) and is closest to the left border (left_(q) _(k+1) _(,p) _(i−1) ) of the sequence group q_(k+1).

If r_(q) _(k+1) _(,p) _(i−1) /N_(p) _(i−1) −1/C_(p) _(i−1) −right_(q) _(k) _(,p) _(i−1) ≦0, namely, r_(q) _(k+1) _(,p) _(i−1) /N_(p) _(i−1) 1/C_(p) _(i−1) is less than the right border (right_(q) _(k) _(,p) _(i−1) ) of the sequence group q_(k), then v_(q) _(k) _(,p) _(i) =v_(q) _(k) _(,p) _(i−1) +r_(q) _(k+1) _(,p) _(i−1) /N_(p) _(i−1) −1/C_(p) _(i−1) −right_(q) _(k) _(,p) _(i−1) , to ensure low cross correlation between the sequence group q_(k) and its adjacent sequence group q_(k+1); if r_(q) _(k+1) _(,p) _(i−1) /N_(p) _(i−1) −1/C_(p) _(i−1) −right_(q) _(k) _(,p) _(i−1) >0, namely, r_(q) _(k+1) _(,p) _(i−1) /N_(p) _(i−1) −1/C_(p) _(i−1) is greater than the right border (right_(q) _(k) _(,p) _(i−1) ) of the sequence group q_(k), then v_(q) _(k) _(,p) _(i) =v_(q) _(k) _(,p) _(i−1) .

For the basic sequence with a length of N_(p) _(i−1) , depending on the value of r_(p) _(i−1) , r_(q) _(k) _(,p) _(i−1) that meets r_(p) _(i−1) /N_(p) _(i−1) −right_(q) _(k) _(,p) _(i−1) ≦0 and minimum |r_(p) _(i−1) /N_(p) _(i−1) −right_(q) _(k) _(,p) _(i−1) | is obtained, namely, the obtained basic sequence q_(k) is included in the sequence group N_(p) _(i−1) , has a length of q_(k) and is closest to the right border (right_(q) _(k) _(,p) _(i−1) ) of the sequence group r_(q) _(k) _(,p) _(i−1) .

If r_(q) _(k) _(,p) _(i−1) /N_(p) _(i−1) +1/C_(p) _(i−1) −left_(q) _(k+1) _(,p) _(i−1) ≧0, namely, r_(q) _(k) _(,p) _(i−1) /N_(p) _(i−1) +1/C_(p) _(i−1) is greater than the left border (q_(k+1)) of the sequence group left_(q) _(k+1) _(,p) _(i−1) , then u_(q) _(k+1) _(,p) _(i) =u_(q) _(k+1) _(,p) _(i−1) +r_(q) _(k) _(,p) _(i−1) /N_(p) _(i−1) +1/C_(p) _(i−1) −left_(q) _(k+1) _(,p) _(i−1) , to ensure low cross correlation between the sequence group q_(k) and its adjacent sequence group q_(k+1); if r_(q) _(k) _(,p) _(i−1) /N_(p) _(i−1) +1/C_(p) _(i−1) −left_(q) _(k+1) _(,p) _(i−1) <0, namely, r_(q) _(k) _(,p) _(i−1) /N_(p) _(i−1) +1/C_(p) _(i−1) is less than the left border (q_(k+1)) of the sequence group left_(q) _(k+1) _(,p) _(i−1) , u_(q) _(k+1) _(,p) _(i) =u_(q) _(k+1) _(,p) _(i−1) .

q_(N) _(p1) ⁻¹ of the sub-group p_(i) of the sequence group

v_(qN) _(p1) _(−1,P) _(i)

and q₁ of the sub-group p_(i) of the sequence group u_(q) _(i) _(,p) _(i) (iεS) are:

right_(q_(N_(p₁) − 1), p_(i − 1)) = v_(q_(N_(p₁ ) − 1), p_(i − 1)) + (N_(p₁) − 1)/N_(p₁), left_(q₁, p_(i − 1)) = u_(q₁, p_(i − 1)) + 1/N_(p₁) right_(q_(N_(p₁) − 1), p_(i − 1))^(′) = v_(q_(N_(p₁) − 1), p_(i − 1)) − 1/N_(p₁), left_(q₁, p_(i − 1))^(′) − u_(q₁, p_(i − 1)) + (N_(p₁) + 1)/N_(p₁)

For the basic sequence with a length of N_(p) _(i−1) , depending on the value of r_(p) _(i−1) , r_(q) _(i) _(,p) _(i−1) that meets r_(p) _(i−1) /N_(p) _(i−1) −left_(q) _(i) _(,p) _(i−1) ≧0 and minimum |r_(p) _(i−1) /N_(p) _(i−1) −left_(q) _(i) _(,p) _(i−1) | is obtained;

If

  r_(q₁, p_(i − 1))/N_(p_(i − 1)) − 1/C_(p_(i − 1)) − right_(q_(N_(p₁) − 1), p_(i − 1))^(′) ≤ 0, then v_(q_(N_(p₁) − 1), p_(i)) = v_(q_(N_(p₁) − 1), p_(i − 1)) + r_(q₁, p_(i − 1))/N_(p_(i − 1)) − 1/C_(p_(i − 1)) − right_(q_(N_(p₁) − 1), p_(i − 1))^(′);   if  r_(q₁, p_(i − 1))/N_(p_(i − 1)) − 1/C_(p_(i − 1)) − right_(q_(N_(p₁) − 1), p_(i − 1))^(′) > 0, then   v_(q_(N_(p₁) − 1), p_(i)) = v_(q_(N_(p₁) − 1), p_(i − 1));

For the basic sequence with a length of N_(p) _(i−1) , depending on the value of r_(p) _(i−1) ,

r_(q_(N_(P 1) − 1), p_(i − 1))

that meets

r_(p_(i − 1))/N_(p_(i − 1)) − right_(q_(N_(p₁) − 1), p_(i − 1)) ≤ 0

and minimum

r_(p_(i − 1))/N_(p_(i − 1)) − right_(q_(N_(p₁) − 1), p_(i − 1))

is obtained;

If

r_(q_(N_(p₁) − 1), p_(i − 1))/N_(p_(i − 1)) + 1/C_(p_(i − 1)) − left_(q₁, p_(i − 1))^(′) ≥ 0, then u_(q₁, p_(i)) = u_(q₁, p_(i − 1)) + r_(q_(N_(p₁) − 1), p_(i − 1))/N_(p_(i − 1)) + 1/C_(p_(i − 1)) − left_(q₁, p_(i − 1))^(′); if r_(q_(N_(p₁) − 1), p_(i − 1))/N_(p_(i − 1)) + 1/C_(p_(i − 1)) − left_(q₁, p_(i − 1))^(′) < 0, then  u_(q₁, p₁) = u_(q₁, p_(i − 1));

Particularly, C_(p) _(i−1) −2N_(p) _(i−1) .

Step 1003: u_(q) _(k) _(,p) _(i) and v_(q) _(k) _(,p) _(i) of the sub-group p_(i) in the sequence group q_(k) (k=1, . . . , N_(p) _(i) −1, iεI−S) are:

u_(q) _(k) _(,p) _(i) =u_(q) _(k) _(,p) _(m) and v_(q) _(k) _(,p) _(i) =v_(q) _(k) _(,p) _(m) , respectively

where I and S are two index collections; in the collection I={2, 3 . . . , L}, L is the quantity of sequence lengths in a candidate sequence collection, and the collection S is the collection I or a sub-collection of the collection I, and m is an element with the maximum value in the collection S.

In the following example, δ_(u)=0, δ_(v)=0, D=2N_(p) _(i) , C_(p) _(i−1) =2N_(p) _(i−1) , q_(k)=k, and p_(i)=i.

Example 1

In this example, there are 4 sub-groups in total. The candidate sequence collection contains the Zadoff-Chu are sequences with N₁=11, N₂=23, N₃=37, and N₄=47 respectively. Taking the fourth sequence group as an example (namely, k=4), v_(4,i) and u_(5,i) iε{1, 2, 3, 4} are obtained through step 1101, specifically:

For the sub-group 1, v_(4,1)=1/(2×11), u_(5,1)=−1/(2×11).

For the sub-group 2, right_(4,1)=v_(4,1)+4/11=1/(2×11)+4/11, left_(5,1)=u_(5,1)+5/11=−1/(2×11)+5/11; because no r_(5,1) or r_(4,1) compliant with the conditions exists, v_(4,2)=v_(4,1), namely, v_(4,2)=1/(2×11); u_(5,2)=u_(5,1), namely, u_(5,2)=−1/(2×11).

For the sub-group 3, right_(4,2)=v_(4,2)+4/11=1/(2×11)+4/11, left_(5,2)=u_(5,2)+5/11=−1/(2×11)+5/11.

For N₂=23, when r₂ varies, if r_(5,2)=10, then r_(5,2)/N₂−left_(5,2)>0 and |r_(5,2)/N₂−left_(5,2)| is the minimum value; because r_(5,2)/N₂−½(N₂)−right_(4,2)>0, v_(4,3)=v_(4,2), namely, v_(4,3)=1/(2×11).

For N₂=23, when r₂ varies, if r_(4,2)=9, then r_(4,2)/N₂−right_(4,2)<0 and |r_(4,2)/N₂−right_(4,2)| is the minimum value; because r_(4,2)/N₂+1/(2N₂)−left_(5,2)>0, u_(5,3)=u_(5,2)+r_(4,2)/N₂+1/(2N₂)−left_(5,2)=−1/(2×11)+9/23+1/(2×23)−(−1/(2×11)+5/11)=−21/(2×11×23).

For the sub-group 4, right_(4,3)=v_(4,3)+4/11=1/(2×11)+4/11, left_(5,3)=u_(5,3)+5/11=−21/(2×11×23)+5/11.

For N₃=37, when r₃ varies, if r_(5,3)=16, then r_(5,3)/N₃−left_(5,3)>0 and |r_(5,3)/N₃−left_(5,3)| is the minimum value; because r_(5,3)/N₃−1/(2N₃)−right_(4,3)>0, v_(4,4)=v_(4,3), namely, v_(4,4)=1/(2×11).

For N₃=37, when r₃ varies, if r_(4,3)=15, then r_(4,3)/N₃−right_(4,3)<0 and |r_(4,3)/N₃−right_(4,3)| is the minimum value; because r_(4,3)/N₃+1/(2N₃)−left_(5,3)>0,

u_(5, 4) = u_(5, 3) + r_(4, 3)/N₃ + 1/(2N₃) − left_(5, 3) = −21/(2 × 11 × 23) + 15/37 + 1/(2 × 37) − (−21/(2 × 11 × 23) + 5/11) = −29/(2 × 11 × 37).

By analogy, u and v of all sub-groups of all sequence groups are obtained, and the following table is generated:

TABLE 7 Group Sub-Group i Number k 1 2 3 4 1 u_(1,1) = −1/(2 × 11) u_(1,2) = −1/(2 × 11) u_(1,3) = −1/(2 × 11) u_(1,4) = −1/(2 × 11) v_(1,1) = 1/(2 × 11) v_(1,2) = 1/(2 × 11) v_(1,3) = 1/(2 × 11) v_(1,4) = 1/(2 × 11) 2 u_(2,1) = −1/(2 × 11) u_(2,2) = −1/(2 × 11) u_(2,3) = −15/(2 × 11 × 23) u_(2,4) = −15/(2 × 11 × 23) v_(2,1) = 1/(2 × 11) v_(2,2) = 1/(2 × 11) v_(2,3) = 1/(2 × 11) v_(2,4) = 1/(2 × 11) 3 u_(3,1) = −1/(2 × 11) u_(3,2) = −1/(2 × 11) u_(3,3) = −17/(2 × 11 × 23) u_(3,4) = −17/(2 × 11 × 23) v_(3,1) = 1/(2 × 11) v_(3,2) = 1/(2 × 11) v_(3,3) = 1/(2 × 11) v_(3,4) = 1/(2 × 11) 4 u_(4,1) = −1/(2 × 11) u_(4,2) = −1/(2 × 11) u_(4,3) = 19/(2 × 11 × 23) u_(4,4) = −19/(2 × 11 × 23) v_(4,1) = 1/(2 × 11) v_(4,2) = 1/(2 × 11) v_(4,3) = 1/(2 × 11) v_(4,4) = 1/(2 × 11) 5 u_(5,1) = −1/(2 × 11) u_(5,2) = −1/(2 × 11) u_(5,3) = −21/(2 × 11 × 23) u_(5,4) = −29/(2 × 11 × 37) v_(5,1) = 1/(2 × 11) v_(5,2) = 1/(2 × 11) v_(5,3) = 1/(2 × 11) v_(5,4) = 1/(2 × 11) 6 u_(6,1) = −1/(2 × 11) u_(6,2) = −1/(2 × 11) u_(6,3) = −1/(2 × 11) u_(6,4) = −1/(2 × 11) v_(6,1) = 1/(2 × 11) v_(6,2) = 1/(2 × 11) v_(6,3) = 21/(2 × 11 × 23) v_(6,4) = 29/(2 × 11 × 37) 7 u_(7,1) = −1/(2 × 11) u_(7,2) = −1/(2 × 11) u_(7,3) = −1/(2 × 11) u_(7,4) = −1/(2 × 11) v_(7,1) = 1/(2 × 11) v_(7,2) = 1/(2 × 11) v_(7,3) = 19/(2 × 11 × 23) v_(7,4) = 19/(2 × 11 × 23) 8 u_(8,1) = −1/(2 × 11) u_(8,2) = −1/(2 × 11) u_(8,3) = −1/(2 × 11) u_(8,4) = −1/(2 × 11) v_(8,1) = 1/(2 × 11) v_(8,2) = 1/(2 × 11) v_(8,3) = 17/(2 × 11 × 23) v_(8,4) = 17/(2 × 11 × 23) 9 u_(9,1) = −1/(2 × 11) u_(9,2) = −1/(2 × 11) u_(9,3) = −1/(2 × 11) u_(9,4) = −1/(2 × 11) v_(9,1) = 1/(2 × 11) v_(9,2) = 1/(2 × 11) v_(9,3) = 15/(2 × 11 × 23) v_(9,4) = 15/(2 × 11 × 23) 10 u_(10,1) = −1/(2 × 11) u_(10,2) = −1/(2 × 11) u_(10,3) = −1/(2 × 11) u_(10,4) = −1/(2 × 11) v_(10,1) = 1/(2 × 11) v_(10,2) = 1/(2 × 11) v_(10,3) = 1/(2 × 11) v_(10,4) = 1/(2 × 11)

Step 1102: The sequences that meet u_(k,i)≦(r_(i)/N_(i)−k/N₁)≦v_(k,i) are selected and included into the sub-group i of the sequence group k, where the sequence is represented by a basic sequence index. Thus the following table is generated:

TABLE 8 N₁ = 11 N₂ = 23 N₃ = 37 N₄ = 47 Group Basic Sequence Basic Sequence Basic Sequence Number K Index r₂ Index r₃ Index r₄ 1 2, 3 2, 3, 4, 5 3, 4, 5, 6 2 4, 5 6, 7, 8 8, 9, 10 3 6, 7 9, 10, 11 12, 13, 14 4 8, 9 13, 14, 15 16, 17, 18, 19 5 10, 11 16, 17, 18 20, 21, 22, 23 6 12, 13 19, 20, 21 24, 25, 26, 27 7 14, 15 22, 23, 24 28, 29, 30, 31 8 16, 17 26, 27, 28 33, 34, 35 9 18, 19 29, 30, 31 37, 38, 39 10 20, 21 32, 33, 34, 35 41, 42, 43, 44

Example 2

If the sequence group contains more sub-groups, after u and v are calculated to a certain sub-group, u and v of the sub-groups of longer sequences do not change any more. For example, if the system bandwidth is 5 Mbps, the sequence lengths include: N₁=11, N₂=23, N₃=37, N₄=47, N₅=59, N₆=71, N₇=97, N₈=107, N₉=113, N₁₀=139, N₁₁=179, N₁₂=191, N₁₃=211, N₁₄=239, N₁₅=283, and N₁₆=293. Taking the fourth sequence group as an example, namely, k=4, v_(4,i) and u_(5,i) iε{1, 2, 3, . . . , 16} are obtained in the following way:

For the sub-group 1, v_(4,1)=1/(2×11), and u_(5,1)=−1/(2×11).

For the sub-group 2, right_(4,1)=v_(4,1)+4/11=1/(2×11)+4/11, left_(5,1)=u_(5,1)+5/11=−1/(2×11)+5/11; because no r_(5,1) or r_(4,1) compliant with the conditions exists, v_(4,2)=v_(4,1), namely, v_(4,2)=1/(2×11); u_(5,2)=u_(5,1), namely, u_(5,2)=1/(2×11).

For the sub-group 3, right_(4,2)=v_(4,2)+4/11=1/(2×11)+4/11, and left_(5,2)=u_(5,2)+5/11=−1/(2×11)+5/11.

For N₂=23, when r₂ varies, if r_(5,2)=10, then r_(5,2)/N₂−left_(5,2)>0 and |r_(5,2)/N₂−left_(5,2)| is the minimum value; because r_(5,2)/N₂−½(N₂)−right_(4,2)>0, v_(4,3)=v_(4,2), namely, v_(4,3)=1/(2×11).

For N₂=23, when r₂ varies, if r_(4,2)=9, then r_(4,2)/N₂−right_(4,2)<0 and |r_(4,2)/N₂−right_(4,2)| is the minimum value; because r_(4,2)/N₂+1/(2N₂)−left_(5,2)>0,

u_(5, 3) = u_(5, 2) + r_(4, 2)/N₂ + 1/(2N₂) − left_(5, 2) = −1/(2 × 11) + 9/23 + 1/(2 × 23) − (−1/(2 × 11) + 5/11) = −21/(2 × 11 × 23).

For the sub-group 4, right_(4,3)=v_(4,3)+4/11=1/(2×11)+4/11, and left_(5,3)=u_(5,3)+5/11=−21/(2×11×23)+5/11.

For N₃=37, when r₃ varies, if r_(5,3)=16, then r_(5,3)/N₃−left_(5,3)>0 and |r_(5,3)/N₃−left_(5,3)| is the minimum value; because r_(5,3)/N₃−1/(2N₃)−right_(4,3)>0, v_(4,4)=v_(4,3), namely, v_(4,4)=1/(2×11).

For N₃=37, when r₃ varies, if r_(4,3)=15, then r_(4,3)/N₃−right_(4,3)<0 and |r_(4,3)/N₃−right_(4,3)| is the minimum value; because r_(4,3)/N₃+1/(2N₃)−left_(5,3)>0,

u_(5, 4) = u_(5, 3) + r_(4, 3)/N₃ + 1/(2N₃) − left_(5, 3) = −21/(2 × 11 × 23) + 15/37 + 1/(2 × 37) − (−21/(2 × 11 × 23) + 5/11) = −29/(2 × 11 × 37)

For the sub-group 5, v_(4,5)=v_(4,4), namely, v_(4,5)=1/(2×11); u_(5,5)=u_(5,4), namely, u_(5,5)=−29/(2×11×37).

For the sub-group 6, namely, v_(4,6)=v_(4,5), namely, v_(4,6)=1/(2×11); u_(5,6)=u_(5,5), namely, u_(5,6)=−29/(2×11×37).

For the sub-group 7, v_(4,7)=v_(4,6), namely, v_(4,7)=1/(2×11); u_(5,7)=u_(5,6), namely, u_(5,7)=−29/(2×11×37).

Further calculation reveals that: for sub-groups 8, 9, 10, . . . , 16, the values of u and v do not change any more.

By analogy, u and v of all sub-groups of other sequence groups may be obtained. Calculation reveals that: for any sub-group i of the sequence group 5, v_(5,i)=1/(2×11). Based on the foregoing calculation, the sequences that meet u_(5,i)≦(r_(i)/N_(i)−5/N₁)≦v_(5,i) are selected and included into the sub-group i of the sequence group 5, where the sequence is represented by a basic sequence index. Thus the following table is generated:

TABLE 9 N₁ = 11 group number k 5 N₂ = 23 basic sequence index r₂ 10, 11 N₃ = 37 basic sequence index r₃ 16, 17, 18 N₄ = 47 basic sequence index r₄ 20, 21, 22, 23 N₅ = 59 basic sequence index r₅ 25, 26, 27, 28, 29 N₆ = 71 basic sequence index r₆ 30, 31, 32, 33, 34, 35 N₇ = 97 basic sequence index r₇ 41, 42, 43, 44, 45, 46, 47, 48 N₈ = 107 basic sequence index r₈ 45, 46, 47, 48, 49, 50, 51, 52, 53 N₉ = 113 basic sequence index r₉ 48, 49, 50, 51, 52, 53, 54, 55, 56 N₁₀ = 139 basic sequence index r₁₀ 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69 N₁₁ = 179 basic sequence index r₁₁ 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89 N₁₂ = 191 basic sequence index r₁₂ 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95 N₁₃ = 211 basic sequence index r₁₃ 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105 N₁₄ = 239 basic sequence index r₁₄ 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119 N₁₅ = 283 basic sequence index r₁₅ 119, 120, 121, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141 N₁₆ = 293 basic sequence index r₁₆ 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146

The foregoing calculation of u_(k,i),v_(k,i) reveals that: the same u_(k,i),v_(k,i) may be determined when calculated to N₄=47 (namely, S={2, 3, 4}) and N₁₆=293 (namely, S=I={2, 3, . . . , 16}). Therefore, the calculation may continue only to the fourth sub-group, namely, S={2, 3, 4} to obtain u and v of all sub-groups of all sequence groups and reduce the calculation load.

In practice, u and v in use may be quantized according to the foregoing calculation results to achieve the required precision.

In the foregoing embodiment, selection of the n sequences comes in two circumstances:

Preferably, n is 1, namely, in the foregoing example, a sequence that makes (r_(m)/N_(m)−k/N₁) the smallest is selected and included into the sub-group m.

Preferably, n is a natural number greater than 1, and the value of n depends on the length difference between sub-group N_(m) and reference sub-group N₁. The sequences corresponding to several basic sequence indexes near r_(m) that makes (r_(m)/N_(m)−k/N₁) the smallest are included into a sub-group. Generally, such sequences are n sequences closest to the minimum r_(m), where n depends on the length difference between N₁,N_(m). For example, if N_(m) is about 4×N¹, two r_(m)'s may be included into the group. Generally, n=┌N_(m)/(2N¹)┐ may be selected. In another example, n=└N_(m)/N₁┘ may be selected, where └z┘ is the maximum integer not greater than z. In the sequence sub-group in this case, there may be more than one sequence of a certain length. After such allocation in the system, when using the sequence, the user may select any of the allocated n sequences for transmitting, for example, select the sequence that makes (r_(m)/N_(m)−k/N₁) the smallest, second smallest, and so on.

In the foregoing embodiment, n sequences are selected, where n is preferably determined by the sequence group k and sub-group i. For example, n≦Q, where Q is the quantity of sequences that meet u_(k,i)≦(r_(i)/N_(i)−c_(k)/N_(p) _(i) )≦v_(k,i), N_(p) _(i) is the length of the reference sub-group sequence, and c_(k) is the basic sequence index of the sequence with a length of N_(p) _(i) determined by the sequence group k. u_(k,i)=−1/(2N₁), v_(k,i)=1/(2N₁), or u_(k,i)=−1/(2N₁)+1/(4N₂), v_(k,i)=1/(2N₁)−1/(4N₂), or u_(k,i)=−½^(θ), v_(k,i)=½^(θ), and so on, where θ is an integer. If u_(k,i) and v_(k,i) are relatively small, for example, u_(k,i)=−1/(2N₁)+1/(4N₂) and v_(k,i)=1/(2N₁)−1/(4N₂), the correlation between any two sequences of different sequence groups is ensured to be low.

In the foregoing embodiments, the sequence groups may be generated for the sequences corresponding to partial instead of all modes of occupying time frequency resources in the system. For example, the modes of occupying time frequency resources may be divided into multiple levels according to the length of the sequence. Each level includes sequences in a certain length range. For the sequences at each level, the sequence groups are generated and allocated, as described above.

Specifically, the sequence groups may be allocated dynamically, namely, the sequence in use varies with time or other variables; or the sequence groups are allocated statically, namely, the sequence in use is constant. More specifically, the static allocation mode may be used alone, or the dynamic allocation mode is used alone, or both the dynamic allocation mode and the static allocation mode are used, as detailed below:

Preferably, if few radio resources are occupied by the sequence, the sequence groups are allocated dynamically. That is because the sequent length is small in this circumstance, and there are fewer sequence groups. For example, as regards the method of “hopping” a sequence group: in the foregoing embodiment taking the Zadoff-Chu sequence as an example, a serial number (r₁) of a reference sequence group is selected randomly in the pseudo random mode at the time of transmitting the pilot frequency, and then the sequence with the index r_(k) in the sub-group of the same sequence group is calculated out according to the foregoing selection mode.

Preferably, if many radio resources are occupied by the sequence, the sequence groups are allocated statically. For example, in the foregoing embodiment taking the Zadoff-Chu sequence as an example, if the quantity (N) of sequence groups meets the need, the N sequence groups are allocated to each cell, which meets the requirements of averaged interference between cells without changing with time. Preferably, the radio resources occupied in the system may be divided into two levels. One level is about the sequences that occupy many radio resources, where different sequence groups are allocated statically; the other level is about the sequences that occupy few radio resources, where the sequence groups allocated in the dynamic pseudo random mode. For example, if a sequence occupies more than 144 sub-carriers, the sequence length is generally greater than or equal to 144, and different sequence groups are allocated statically; if the sequences in each sequence group correspond to radio resources of less than 144 sub-carriers, the sequence length is generally less than 144, and the sequence groups are allocated in the dynamic pseudo random mode.

If a sub-group contains multiple sequences, including basic sequences and the sequences of different time cyclic shifts, the sequences may be allocated not only to different users, but also to different cells, for example, different sectors under a base station. Particularly, if a cell needs more sequences, for example, if multi-antenna transmitting is supported, each antenna needs to have a different sequence. In this case, the minimum length of the sequence in use may be limited to increase the quantity of basic sequences in the sub-group. Therefore, more basic sequences in the sub-group or more cyclic shifts of the basic sequences may be allocated to the cell. Further, if the sub-group in the sequence group has multiple sequences, the sequence groups may be further grouped and allocated to different cells, users or channels.

The aforementioned sequences are not limited to Zadoff-Chu sequences, and may be Gauss sequences, other CAZAC sequences, basic sequences, and/or deferred sequences of CAZAC sequences.

Embodiment 2

Corresponding to the aforementioned method for allocating sequence groups to cells in a specific selection mode in a network, a method for processing communication sequences is described. As shown in FIG. 4, the process of the method includes:

Step 201: The group number k of the sequence group allocated by the system is obtained.

Step 202: N (n is a natural number) sequences are selected from the candidate sequence collection to form sequences in the sub-group i (i is a serial number of the sub-group) in the sequence group k, where the n sequences make the d(f_(i)(•),G_(k)) function value the smallest, second smallest, and third smallest respectively, d(a,b) is a two variables function, G_(k) is a variable determined by the group number k, f_(i)(•) is a function corresponding to the sub-group i determined by the system, and the domain of the function is the candidate sequence collection corresponding to the sub-group i.

Step 203: The corresponding transmitting sequences are generated according to the formed sub-group i, and the sequences on the corresponding time frequency resources are processed.

Processing of communication sequences includes transmitting and receiving of communication sequences. Receiving of communication sequences includes calculation related to the generated sequences and received signals. Generally, the specific receiving operations include the calculation for obtaining channel estimation or time synchronization.

The aforementioned sequences are not limited to Zadoff-Chu sequences, and may be Gauss sequences, other CAZAC sequences, basic sequences, and/or shifted sequences of CAZAC sequences. The processing of sequences may be frequency domain processing or time domain processing. The functions in the foregoing method may be consistent with the functions in the foregoing allocation method, and are not repeated further.

Taking the Zadoff-Chu sequence as an example, if the function d(a,b) is d(a,b)=|(a−b)|, for the sub-group m, the sequence that makes the |r_(m)/N_(m)−k/N₁| value the smallest is selected and included into the sequence group k, thus ensuring higher correlation between sequences and reducing correlation between groups.

In practice, working out the r_(m) indexes that make |r_(m)/N_(m)−k/N₁| the smallest, second smallest, . . . , may induce a general method. That is, with an known integer N₁,N₂,e, the integer f needs to make the |e/N₁−f/N₂| value the smallest. Evidently, f is the integer w closest to e·N₂/N₁, namely, the └e·N₂/N₁┘ value rounded down or the ┌e·N₂/N₁┐ value rounded up. The fewer n sequences are w±1, w±2, . . . .

The transmitter and the receiver may obtain the data through calculation in this way rather than store the data.

Still taking the Zadoff-Chu sequence as an example, if the function d(a,b) is |(a−b) modu m_(k,i)|, the sub-group numbered p₁ serves as a reference sub-group, N_(p) ₁ is the length of the reference sub-group sequence, c_(k) is the basic sequence index of the sequence with a length of N_(p) ₁ determined by the sequence group k, N_(i) is the length of the sequence of the sub-group i, and r_(i) is the basic sequence index of the sequence with a length of N_(i) determined by the sequence group k, then, |(a−b) modu m_(k,i)|=|(r_(i)/N_(i)−c_(k)/N_(p) ₁ ) modu m_(k,i)|. Particularly, N_(p) ₁ =N₁ and c_(k)=k may be selected. For the sub-group i=q in the sequence group k, the sequence that makes |(r_(q)/N_(q)−k/N₁) modu m_(k,q)| the smallest is selected and included into the sequence group k. Therefore, the selected sequence is the most correlated with the sequence of the reference length in the same sequence group, the correlation of the sequences between different groups is further reduced, and the inter-group interference is weaker.

In practice, working out the index r_(q) that makes |(r_(q)/N_(q)−k/N₁) modu m_(k,q)| the smallest may induce a general method, namely, r_(q)=B⁻¹×round(B×k×N_(q)/N₁), where B=1/m_(k,q), B⁻¹ is a natural number that meets B×B⁻¹ mod N_(q)=1, and round(z) is an integer closest to z.

A detailed description is given below through examples. With a known integer N₁,N₂,e, if m_(k,q)=1, then the integer f needs to make the |(e/N₁−f/N₂) modu 1| value the smallest. Evidently, f is the integer w closest to e·N₂/N₁, namely, the └e·N₂/N₁┘ value rounded down or the ┌e·N₂/N₁┘ value rounded up. If m_(k,q)=½, then the integer f needs to make the |(e/N₁−f/N₂) modu ½| value the smallest. f is

$w \cdot \frac{1 + N_{2}}{2}$

modulo N₂, namely,

$w \cdot \frac{1 + N_{2}}{2}$

mod N₂, where w is an integer closest to 2e·N₂/N₁, namely, the └2e·N₂/N₁┘ value rounded down or the └2e·N₂/N₁┘ value rounded up. If m_(k,q)=⅓, then the integer f needs to make the |(e/N₁−f/N₂) modu ⅓| value the smallest. When N₂ mod 3=0, f is

$\frac{w}{3};$

when N₂ mod 3=1, f is

$w \cdot \frac{1 - N_{2}}{3}$

mod N₂; when N₂ mod 3=2, f is

$w \cdot \frac{1 + N_{2}}{3}$

mod N₂, where w is an integer closest to 3e·N₂/N₁, namely, the └3e·N₂/N₁┘ value rounded down or the └3e·N₂/N₁┘ value rounded up. If m_(k,q)=¼, then the integer f needs to make the |(e/N₁−f/N₂) modu ¼| value the smallest. When N₂ mod 2=0, f is

$\frac{w}{4};$

when N₂ mod 4=1, f is

$w \cdot \frac{1 - N_{2}}{4}$

mod N₂; when N₂ mod 4=3, f is

$w \cdot \frac{1 + N_{2}}{4}$

mod N₂, where w is an integer closest to 4e·N₂/N₁, namely, the └4e·N₂/N₁┘ value rounded down or the ┌4e·N₂/N₁┐ value rounded up.

To sum up, through m_(k,q) storage and simple calculation, the sequences in the sub-group q in the sequence group k are obtained. According to the inherent features of m_(k,q), the m_(k,q) storage may be simplified, as detailed below:

m_(k,q) of the sub-group q is symmetric between different sequence groups k, namely, m_(k,q)=m_(T−k,q), where T is the total number of sequence groups. Therefore, if m_(k,q) in the case of 1≦k≦T/2 is pre-stored, m_(k,q) in the case of 1≦k≦T can be obtained; or, if m_(k,q) in the case of T/2<k≦T is pre-stored, m_(k,q) in the case of 1≦k≦T can also be obtained.

If N_(q)≧L_(r), it is appropriate that m_(k,q)=1, where N_(q) is the sequence length of the sub-group q, and L_(r) is determined by the reference sub-group sequence length N_(p) ₁ . Specifically, for N_(p) ₁ =N₁=31, L_(r)=139. If N_(q)=139 or above, then m_(k,q)=1. After cyclic extension of the sequence, L_(r)=191. Therefore, when N_(q)=191 or above, m_(k,q)=1.

The specific values of m_(k,q) corresponding to the sub-group q in the sequence group k may be stored. Specifically, x bits may be used to represent W different values of m_(k,q), where 2^(x−1)<W≦2^(x); for each m_(k,q), the x bits that represent the specific values of m_(k,q) are stored. Alternatively, the value selection mode of m_(k,q) may also be stored. For example, when N_(q)≧L_(r), m_(k,q)=1.

In the foregoing embodiment, after the resource occupied by the sequence is determined, the sequence of the sub-group corresponding to the resource of the current group may be generated in real time according to the selection mode, without the need of storing. The implementation is simple.

It is understandable to those skilled in the art that all or part of the steps in the foregoing embodiments may be implemented by hardware instructed by a program. The program may be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk and compact disk, and the steps covered in executing the program are consistent with the foregoing steps 201-203.

Embodiment 3

As shown in FIG. 5, an apparatus for processing communication sequences by using the foregoing communication sequence processing method includes: a sequence selecting unit, adapted to: obtain a group number k of a sequence group allocated by the system, and select n (n is a natural number) sequences from a candidate sequence collection to form sequences in a sub-group i (i is a serial number of the sub-group) in the sequence group k (k is the serial number of the sequence group), where the n sequences make the d(f_(l)(•),G_(k)) function value the smallest, second smallest, and third smallest respectively, d(a,b) is a two variables function, G_(k) is a variable determined by the group number k, f_(l)(•) is a function corresponding to the sub-group i determined by the system, and the domain of the function is the candidate sequence collection corresponding to the sub-group i; and

a sequence processing unit, adapted to: select or generate the corresponding sequences according to the sequences in the formed sub-group i, and process the sequences on the time frequency resources corresponding to the sub-group i.

Specifically, as shown in FIG. 6, the sequence processing unit is a sequence transmitting unit adapted to generate the corresponding sequences according to the formed sequences and transmit the sequences on the corresponding time frequency resources. In this case, the communication sequence processing apparatus is a communication sequence transmitting apparatus.

Specifically, as shown in FIG. 7, the sequence processing unit may be a sequence receiving unit adapted to generate the corresponding sequences according to the formed sequences and receive the sequences on the corresponding time frequency resources. In this case, the communication sequence processing apparatus is a communication sequence receiving apparatus. The receiving processing generally includes calculation related to the generated sequences and received signals. Generally, the specific receiving operations include the calculation for obtaining channel estimation or time synchronization.

The relevant functions and specific processing in the communication sequence processing apparatus are consistent with those in the forgoing allocation method and processing method, and are not repeated further. The aforementioned sequences are not limited to Zadoff-Chu sequences, and may be Gauss sequences, other CAZAC sequences, basic sequences, and/or deferred sequences of CAZAC sequences. The processing of sequences may be frequency domain processing or time domain processing.

In the foregoing communication sequence processing apparatus, the sequence selecting unit selects a sequence compliant with the interference requirement directly in a specific selection mode, without the need of storing the lists about the correspondence of sequences, thus saving communication resources as against the conventional art.

Although exemplary embodiments have been described through the application and accompanying drawings, the claims are not limited to such embodiments. It is apparent that those skilled in the art can make various modifications and variations to the embodiments without departing from the spirit and scope of the claims. 

What is claimed is:
 1. An apparatus, comprising: a processor coupled with a non-transitory storage medium storing executable instructions; wherein the executable instructions, when executed by the processor, cause the terminal device to: determine a sequence index r_(i) based on a group number k, wherein the sequence index r_(i) is determined using the relation ${k*\frac{N_{i}}{N_{1}}},$  wherein N_(i) is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, N₁ is a reference length, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is a index of the Zadoff-Chu sequence group; generate the reference signal sequence according to the sequence index r_(i); and transmit the reference signal sequence.
 2. The apparatus of claim 1, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length
 3. The apparatus of claim 1, wherein the executable instructions, when executed by the processor, cause the terminal device to determine the sequence index r_(i) in a following manner: determining the sequence index r_(i) by rounding down the $k*{\frac{N_{i}}{N_{1}}.}$
 4. The apparatus of claim 3, wherein the executable instructions, when executed by the processor, cause the terminal device further to: generate a second r_(i) value by rounding up the $k*{\frac{N_{i}}{N_{1}}.}$
 5. The apparatus of claim 1, wherein the executable instructions, when executed by the processor, cause the terminal device to determine the sequence index r_(i) in a following manner: determining the sequence index r_(i) by rounding up the $k*{\frac{N_{i}}{N_{1}}.}$
 6. The apparatus of claim 5, wherein the executable instructions, when executed by the processor, cause the terminal device further to: generate a second r_(i) value by rounding down the $k*{\frac{N_{i}}{N_{1}}.}$
 7. The apparatus of claim 1, wherein N₁ is
 31. 8. An apparatus, comprising: a processor coupled with a non-transitory storage medium storing executable instructions; wherein the executable instructions, when executed by the processor, cause the terminal device to: obtain a sequence index r_(i) based on a group number k, wherein the sequence index r_(i) satisfies with ${r_{i} = \left\lfloor {\frac{N_{i}k}{31} + \frac{1}{2}} \right\rfloor},$  wherein N_(i) is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is an index of the Zadoff-Chu sequence group; generate the reference signal sequence according to the sequence index r_(i); and transmit the reference signal sequence.
 9. The apparatus of claim 8, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length.
 10. An apparatus, comprising: a processor coupled with a non-transitory storage medium storing executable instructions; wherein the executable instructions, when executed by the processor, cause the terminal device to: obtain a sequence index r_(i) based on a group number k, wherein a value of the sequence index r minimizes |r_(i)/N_(i)−k/N₁|, wherein N_(i) is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, N₁ is a reference length, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is an index of the Zadoff-Chu sequence group; generate the reference signal sequence according to the sequence index r_(i); and transmit the reference signal sequence.
 11. The apparatus of claim 10, wherein N₁ is
 31. 12. The apparatus of claim 11, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length.
 13. A non-transitory computer-readable storage medium comprising instructions which, when executed by a computer, cause the computer to carry out steps of: determining a sequence index r_(i) based on a group number k, wherein the sequence index r_(i) is determined using the relation ${k*\frac{N_{i}}{N_{1}}},$  wherein N_(i) is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, N₁ is a reference length, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is a index of the Zadoff-Chu sequence group; generating the reference signal sequence according to the sequence index r_(i); and transmitting the reference signal sequence.
 14. The non-transitory computer-readable storage medium of claim 13, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length
 15. The non-transitory computer-readable storage medium of claim 13, wherein the instructions which, when executed by a computer, cause the computer to carry out steps of determining the sequence index r_(i) in a following manner: determining the sequence index r_(i) by rounding down the $k*{\frac{N_{i}}{N_{1}}.}$
 16. The non-transitory computer-readable storage medium of claim 15, wherein the instructions which, when executed by a computer, further cause the computer to carry out steps of: generating a second r_(i) value by rounding up the $k*{\frac{N_{i}}{N_{1}}.}$
 17. The non-transitory computer-readable storage medium of claim 13, wherein the instructions which, when executed by a computer, cause the computer to carry out steps of determining the sequence index r_(i) in a following manner: determining the sequence index r_(i) by rounding up the $k*{\frac{N_{i}}{N_{1}}.}$
 18. The non-transitory computer-readable storage medium of claim 17, wherein the instructions which, when executed by a computer, further cause the computer to carry out steps of: generating a second r_(i) value by rounding down the $k*{\frac{N_{i}}{N_{1}}.}$
 19. The non-transitory computer-readable storage medium of claim 13, wherein N₁ is
 31. 20. A non-transitory computer-readable storage medium comprising instructions which, when executed by a computer, cause the computer to carry out steps of: obtaining a sequence index r_(i) based on a group number k, wherein the sequence index r_(i) satisfies with ${r_{i} = \left\lfloor {\frac{N_{i}k}{31} + \frac{1}{2}} \right\rfloor},$ wherein N_(i) is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is an index of the Zadoff-Chu sequence group; generating the reference signal sequence according to the sequence index r_(i); and transmitting the reference signal sequence.
 21. The non-transitory computer-readable storage medium of claim 20, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length.
 22. A non-transitory computer-readable storage medium comprising instructions which, when executed by a computer, cause the computer to carry out steps of: obtaining a sequence index r_(i) based on a group number k, wherein a value of the sequence index r_(i) minimizes |r_(i)/N_(i)−k/N₁|, wherein N_(i) is a length of a Zadoff-Chu sequence member in a Zadoff-Chu sequence group, N₁ is a reference length, the length of the Zadoff-Chu sequence member is a prime number less than a reference signal sequence length, and the group number k is an index of the Zadoff-Chu sequence group; generating the reference signal sequence according to the sequence index r_(i); and transmitting the reference signal sequence.
 23. The non-transitory computer-readable storage medium of claim 22, wherein N₁ is
 31. 24. The non-transitory computer-readable storage medium of claim 23, wherein the prime number is the largest prime number smaller than the value of the reference signal sequence length. 